Efficient Splitting and Merging Algorithms for Order Decomposable Problems
نویسندگان
چکیده
منابع مشابه
Efficient Splitting and Merging Algorithms for Order Decomposable Problems
Let S be a set whose items are sorted with respect to d > 1 total orders 1 ; : : : ; d , and which is subject to dynamic operations, such as insertions of a single item, deletions of a single item, split and concatenate operations performed according to any chosen order i (1 i d). This generalizes to dimension d > 1 the notion of concatenable data structures, such as the 2-3-trees, which suppor...
متن کاملHulls and Order Decomposable Problems
In this paper we consider dynamic data structures for Order Decomposable Problems. This dass of Problems indude the Convex Hull Problem, the Voronoi Diagram Problem, the Maxima Problem and the Intersection of Half Spaces. This paper first describes a scheme for maintaining convex hulls in the plane dynamically in O(logn) amortized time for insert ions and O(log2n ) time for deletions. O(n) spac...
متن کاملCluster merging and splitting in hierarchical clustering algorithms
Hierarchical clustering constructs a hierarchy of clusters by either repeatedly merging two smaller clusters into a larger one or splitting a larger cluster into smaller ones. The crucial step is how to best select the next cluster(s) to split or merge. Here we provide a comprehensive analysis of selection methods and propose several new methods. We perform extensive clustering experiments to t...
متن کاملApproximation Algorithms for Multi-index Transportation Problems with Decomposable Costs
The axial multi-index transportation problem is defined as follows. Given are k sets A,, each set having n, elements, r = 1,. , k. The Cartesian product of the sets A, is denoted by A. To each element a E A a certain cost, c, E R, is associated. Further, a nonnegative demand e,; is associated to each set Ari = {u E A : u(r) = i}. The problem is to find nonnegative real numbers x0 such that each...
متن کاملApproximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs
The k-dimensional assignment problem with decomposable costs is formulated as follows. Given is a complete k-partite graph G = (X0 u ... u X,_ I, E), with lXil = p for each i, and a nonnegative length function defined on the edges of G. A clique of G is a subset of vertices meeting each Xi in exactly one vertex. The cost of a clique is a function of the lengths of the edges induced by the cliqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1999
ISSN: 0890-5401
DOI: 10.1006/inco.1999.2811